#include <cstdio>
#include <cmath>

bool is_prime(int x);

int main(int argc, char const *argv[]){
    int n;
    while(scanf("%d", &n) != EOF){
        if (n == 0)
            break;
        int prime_1 = 0, prime_2 = 0;
        for (int i = 2; i <= n/2; i++){
            if (is_prime(i) && is_prime(n-i)){
                prime_1 = i;
                prime_2 = n-i;
                break;
            }
        }
        if (prime_1 == 0 && prime_2 == 0)
            printf("Goldbach's conjecture is wrong.\n");
        else
            printf("%d = %d + %d\n", n, prime_1, prime_2);
    }
    return 0;
}

bool is_prime(int x){
    if (x <= 1)
        return false;
    int bound = (int)sqrt(x) + 1;
    for (int i = 2; i < bound; i++){
        if (x % i == 0)
            return false;
    }
    return true;
}
